Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithmic information theory / Gregory J. Chaitin
| Algorithmic information theory / Gregory J. Chaitin |
| Autore | Chaitin, Gregory J. |
| Pubbl/distr/stampa | Cambridge : Cambridge University Press, 1987 |
| Disciplina | 510.78 |
| Collana | Cambridge tracts in theoretical computer science |
| Soggetto non controllato | Teoria dell'informazione |
| ISBN | 0-521-34306-2 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-990001093410403321 |
Chaitin, Gregory J.
|
||
| Cambridge : Cambridge University Press, 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithmic information theory / Gregory J. Chaitin
| Algorithmic information theory / Gregory J. Chaitin |
| Autore | Chaitin, Gregory J. |
| Pubbl/distr/stampa | Cambridge : [etc.] University Press, 1987 (stampa 1990) |
| Descrizione fisica | 177 p. : ill. ; 25 cm |
| Disciplina | 005120 |
| Collana | Cambridge tracts in theoretical computer science |
| Soggetto non controllato |
algoritmi
elaboratori elettronici digitali - programmazione |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000183960203316 |
|
Chaitin, Gregory J.
|
||
| Cambridge : [etc.] University Press, 1987 (stampa 1990) | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic information theory / Gregory J. Chaitin
| Algorithmic information theory / Gregory J. Chaitin |
| Autore | Chaitin, Gregory J. |
| Pubbl/distr/stampa | Cambridge : [etc.] University Press, 1987 (stampa 1990) |
| Descrizione fisica | 177 p. : ill. ; 25 cm |
| Disciplina | 005120 |
| Collana | Cambridge tracts in theoretical computer science |
| Soggetto non controllato |
algoritmi
elaboratori elettronici digitali - progr |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000103660203316 |
|
Chaitin, Gregory J.
|
||
| Cambridge : [etc.] University Press, 1987 (stampa 1990) | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Darwin alla prova : l'evoluzione vista da un matematico / Gregory Chaitin ; traduzione di Daniele A. Gewurz
| Darwin alla prova : l'evoluzione vista da un matematico / Gregory Chaitin ; traduzione di Daniele A. Gewurz |
| Autore | Chaitin, Gregory J. |
| Pubbl/distr/stampa | Torino, : Codice, 2013 |
| Descrizione fisica | 126 p : ill. ; 20 cm |
| Disciplina | 576.82 |
| Soggetto non controllato | Teorie dell'evoluzione |
| ISBN | 978-88-7578-357-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | ita |
| Record Nr. | UNINA-9910422959203321 |
|
Chaitin, Gregory J.
|
||
| Torino, : Codice, 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Exploring RANDOMNESS / Gregory J. Chaitin
| Exploring RANDOMNESS / Gregory J. Chaitin |
| Autore | Chaitin, Gregory J. |
| Pubbl/distr/stampa | London : Springer-Verlag, copyr. 2001 |
| Descrizione fisica | X, 164 p. : ill. ; 20 cm |
| Disciplina | 511.321 |
| Collana | Discrete Mathematics and Theoretical Computer Science |
| Soggetto non controllato |
Teoria delle macchine
Complessità computazionale Linguaggio LISP |
| ISBN | 1-85233-417-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000490800203316 |
|
Chaitin, Gregory J.
|
||
| London : Springer-Verlag, copyr. 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Information randomness & Incompleteness : papers on algorithmic information theory / G. J. Chaitin
| Information randomness & Incompleteness : papers on algorithmic information theory / G. J. Chaitin |
| Autore | Chaitin, Gregory J. |
| Edizione | [2nd ed] |
| Pubbl/distr/stampa | Singapore [etc.] : World Scientific, 1990 |
| Descrizione fisica | V, 320 p. : ill. ; 26 cm |
| Disciplina | 00354 |
| Collana | Series in computer science |
| Soggetto non controllato | teoria dell'informazione |
| ISBN | 981-02-0154-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-990000233180203316 |
|
Chaitin, Gregory J.
|
||
| Singapore [etc.] : World Scientific, 1990 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Information Randomness & Incompleteness : Papers on Algorithmic Information Theory / Gregory J. Chaitin
| Information Randomness & Incompleteness : Papers on Algorithmic Information Theory / Gregory J. Chaitin |
| Autore | Chaitin, Gregory J. |
| Pubbl/distr/stampa | Singapore [etc.] : World Scientific, 1987 |
| Disciplina | 510.78 |
| Collana | World Scientific Series Computer Science |
| Soggetto non controllato |
Cibernetica
Teoria dei giochi Teoria degli automi Intelligenza artificiale |
| ISBN | 9971-50-480-4 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-990001110030403321 |
|
Chaitin, Gregory J.
|
||
| Singapore [etc.] : World Scientific, 1987 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Randomness and complexity [[electronic resource] ] : from Leibniz to Chaitin / / editor, Cristian S. Calude
| Randomness and complexity [[electronic resource] ] : from Leibniz to Chaitin / / editor, Cristian S. Calude |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2007 |
| Descrizione fisica | 1 online resource (466 p.) |
| Disciplina | 519.23 |
| Altri autori (Persone) |
CaludeCristian <1952->
ChaitinGregory J |
| Soggetto topico |
Kolmogorov complexity
Computational complexity Stochastic processes |
| Soggetto genere / forma | Electronic books. |
| ISBN |
1-281-91160-7
9786611911607 981-277-083-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Contents; Preface; Technical Contributions; 1. On Random and Hard-to-Describe Numbers Charles H. Bennett; 1. Berry's Paradox and the Unprovability of Randomness; 2. The Search for a "Random" Real Number; References; 2. Computing Beyond Classical Logic: SVD Computation in Nonassociative Dickson Algebras Francoise Chaitin-Chatelin; 2.1. Introduction; 2.2. Nonassociativity of multiplication; 2.3. Nonassociative Dickson algebras; 2.3.1. Presentation of Dickson's doubling process; 2.3.2. Alternative vectors in Ak, k 4; 2.3.3. The splitting Ak = CDC;1 Dk, k 2
2.4. SVD computation in Dk and Ak, k 32.4.1. c 2 Dk is doubly pure, k 4.; 2.4.2. Deriving the SVD of a in Ak from that of the tail c in Dk, for k 4; 2.4.3. Nonclassical derivation from c to a, k 3; 2.5. Is the nonclassical SVD derivation absurd?; 2.5.1. The conventional analysis; 2.5.2. Induction and nonclassical singular values; 2.6. Conclusion; Acknowledgement; References; 3. Janus-Faced Physics: On Hilbert's 6th Problem N. C. A. da Costa and F. A. Doria; 3.1. Prologue; 3.2. Hilbert's 6th Problem; 3.3. A review of axiomatization techniques 3.4. Structures, species of structures, models 3.5. Axiomatization in mathematics; 3.6. Suppes predicates for classical field theories in physics; 3.7. Generalized incompleteness; 3.8. Higher degrees; 3.9. The function and the arithmetical hierarchy; 3.10. First applications: mechanics and chaos theory; 3.11. Janus-faced physics; Acknowledgments; References; 4. The Implications of a Cosmological Information Bound for Complexity, Quantum Information and the Nature of Physical Law P. C. W. Davies; 4.1. What are the laws of physics?; 4.2. Laws as software; 4.3. The quantum vacuum 4.4. Quantum information processing 4.5. Unfinished business; Acknowledgments; Footnotes; 5. What Is a Computation? Martin Davis; The Turing - Post Language; Codes for Turing - Post Programs; The Universal Program; The Halting Problem; Other Unsolvable Problems; Undecidable Statements; Complexity and Randomness; Unsolvability of Halting Problem; An Unsolvable Word Problem; 6. On the Kolmogorov-Chaitin Complexity for Short Sequences Jean-Paul Delahaye and Hector Zenil; References; 7. Circuit Universality of Two Dimensional Cellular Automata: A Review A. Gajardo and E. Goles; 7.1. Introduction 7.2. Computing through signals 7.2.1. A three states CA by Banks; 7.3. CA over a hexagonal grid and three states; 7.4. Life automata; 7.4.1. Game of life; 7.4.2. Life without death; 7.5. Reversible models; 7.6. Sandpiles; 7.7. Conclusions; Acknowledgments; References; 8. Chaitin's Graph Coloring Algorithm James Goodman; References; 9. A Berry-type Paradox Gabriele Lolli; References; 10. in Number Theory Toby Ord and Tien D. Kieu; 10.1. Recursive Enumerability, Algorithmic Randomness and ; 10.2. Diophantine Equations and Hilbert's Tenth Problem 10.3. Expressing Omega Through Diophantine Equations |
| Record Nr. | UNINA-9910450885903321 |
| Singapore ; ; Hackensack, NJ, : World Scientific, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Randomness and complexity [[electronic resource] ] : from Leibniz to Chaitin / / editor, Cristian S. Calude
| Randomness and complexity [[electronic resource] ] : from Leibniz to Chaitin / / editor, Cristian S. Calude |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2007 |
| Descrizione fisica | 1 online resource (466 p.) |
| Disciplina | 519.23 |
| Altri autori (Persone) |
CaludeCristian <1952->
ChaitinGregory J |
| Soggetto topico |
Kolmogorov complexity
Computational complexity Stochastic processes |
| ISBN |
1-281-91160-7
9786611911607 981-277-083-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Contents; Preface; Technical Contributions; 1. On Random and Hard-to-Describe Numbers Charles H. Bennett; 1. Berry's Paradox and the Unprovability of Randomness; 2. The Search for a "Random" Real Number; References; 2. Computing Beyond Classical Logic: SVD Computation in Nonassociative Dickson Algebras Francoise Chaitin-Chatelin; 2.1. Introduction; 2.2. Nonassociativity of multiplication; 2.3. Nonassociative Dickson algebras; 2.3.1. Presentation of Dickson's doubling process; 2.3.2. Alternative vectors in Ak, k 4; 2.3.3. The splitting Ak = CDC;1 Dk, k 2
2.4. SVD computation in Dk and Ak, k 32.4.1. c 2 Dk is doubly pure, k 4.; 2.4.2. Deriving the SVD of a in Ak from that of the tail c in Dk, for k 4; 2.4.3. Nonclassical derivation from c to a, k 3; 2.5. Is the nonclassical SVD derivation absurd?; 2.5.1. The conventional analysis; 2.5.2. Induction and nonclassical singular values; 2.6. Conclusion; Acknowledgement; References; 3. Janus-Faced Physics: On Hilbert's 6th Problem N. C. A. da Costa and F. A. Doria; 3.1. Prologue; 3.2. Hilbert's 6th Problem; 3.3. A review of axiomatization techniques 3.4. Structures, species of structures, models 3.5. Axiomatization in mathematics; 3.6. Suppes predicates for classical field theories in physics; 3.7. Generalized incompleteness; 3.8. Higher degrees; 3.9. The function and the arithmetical hierarchy; 3.10. First applications: mechanics and chaos theory; 3.11. Janus-faced physics; Acknowledgments; References; 4. The Implications of a Cosmological Information Bound for Complexity, Quantum Information and the Nature of Physical Law P. C. W. Davies; 4.1. What are the laws of physics?; 4.2. Laws as software; 4.3. The quantum vacuum 4.4. Quantum information processing 4.5. Unfinished business; Acknowledgments; Footnotes; 5. What Is a Computation? Martin Davis; The Turing - Post Language; Codes for Turing - Post Programs; The Universal Program; The Halting Problem; Other Unsolvable Problems; Undecidable Statements; Complexity and Randomness; Unsolvability of Halting Problem; An Unsolvable Word Problem; 6. On the Kolmogorov-Chaitin Complexity for Short Sequences Jean-Paul Delahaye and Hector Zenil; References; 7. Circuit Universality of Two Dimensional Cellular Automata: A Review A. Gajardo and E. Goles; 7.1. Introduction 7.2. Computing through signals 7.2.1. A three states CA by Banks; 7.3. CA over a hexagonal grid and three states; 7.4. Life automata; 7.4.1. Game of life; 7.4.2. Life without death; 7.5. Reversible models; 7.6. Sandpiles; 7.7. Conclusions; Acknowledgments; References; 8. Chaitin's Graph Coloring Algorithm James Goodman; References; 9. A Berry-type Paradox Gabriele Lolli; References; 10. in Number Theory Toby Ord and Tien D. Kieu; 10.1. Recursive Enumerability, Algorithmic Randomness and ; 10.2. Diophantine Equations and Hilbert's Tenth Problem 10.3. Expressing Omega Through Diophantine Equations |
| Record Nr. | UNINA-9910777315303321 |
| Singapore ; ; Hackensack, NJ, : World Scientific, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Randomness and complexity [[electronic resource] ] : from Leibniz to Chaitin / / editor, Cristian S. Calude
| Randomness and complexity [[electronic resource] ] : from Leibniz to Chaitin / / editor, Cristian S. Calude |
| Pubbl/distr/stampa | Singapore ; ; Hackensack, NJ, : World Scientific, c2007 |
| Descrizione fisica | 1 online resource (466 p.) |
| Disciplina | 519.23 |
| Altri autori (Persone) |
CaludeCristian <1952->
ChaitinGregory J |
| Soggetto topico |
Kolmogorov complexity
Computational complexity Stochastic processes |
| ISBN |
1-281-91160-7
9786611911607 981-277-083-6 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto |
Contents; Preface; Technical Contributions; 1. On Random and Hard-to-Describe Numbers Charles H. Bennett; 1. Berry's Paradox and the Unprovability of Randomness; 2. The Search for a "Random" Real Number; References; 2. Computing Beyond Classical Logic: SVD Computation in Nonassociative Dickson Algebras Francoise Chaitin-Chatelin; 2.1. Introduction; 2.2. Nonassociativity of multiplication; 2.3. Nonassociative Dickson algebras; 2.3.1. Presentation of Dickson's doubling process; 2.3.2. Alternative vectors in Ak, k 4; 2.3.3. The splitting Ak = CDC;1 Dk, k 2
2.4. SVD computation in Dk and Ak, k 32.4.1. c 2 Dk is doubly pure, k 4.; 2.4.2. Deriving the SVD of a in Ak from that of the tail c in Dk, for k 4; 2.4.3. Nonclassical derivation from c to a, k 3; 2.5. Is the nonclassical SVD derivation absurd?; 2.5.1. The conventional analysis; 2.5.2. Induction and nonclassical singular values; 2.6. Conclusion; Acknowledgement; References; 3. Janus-Faced Physics: On Hilbert's 6th Problem N. C. A. da Costa and F. A. Doria; 3.1. Prologue; 3.2. Hilbert's 6th Problem; 3.3. A review of axiomatization techniques 3.4. Structures, species of structures, models 3.5. Axiomatization in mathematics; 3.6. Suppes predicates for classical field theories in physics; 3.7. Generalized incompleteness; 3.8. Higher degrees; 3.9. The function and the arithmetical hierarchy; 3.10. First applications: mechanics and chaos theory; 3.11. Janus-faced physics; Acknowledgments; References; 4. The Implications of a Cosmological Information Bound for Complexity, Quantum Information and the Nature of Physical Law P. C. W. Davies; 4.1. What are the laws of physics?; 4.2. Laws as software; 4.3. The quantum vacuum 4.4. Quantum information processing 4.5. Unfinished business; Acknowledgments; Footnotes; 5. What Is a Computation? Martin Davis; The Turing - Post Language; Codes for Turing - Post Programs; The Universal Program; The Halting Problem; Other Unsolvable Problems; Undecidable Statements; Complexity and Randomness; Unsolvability of Halting Problem; An Unsolvable Word Problem; 6. On the Kolmogorov-Chaitin Complexity for Short Sequences Jean-Paul Delahaye and Hector Zenil; References; 7. Circuit Universality of Two Dimensional Cellular Automata: A Review A. Gajardo and E. Goles; 7.1. Introduction 7.2. Computing through signals 7.2.1. A three states CA by Banks; 7.3. CA over a hexagonal grid and three states; 7.4. Life automata; 7.4.1. Game of life; 7.4.2. Life without death; 7.5. Reversible models; 7.6. Sandpiles; 7.7. Conclusions; Acknowledgments; References; 8. Chaitin's Graph Coloring Algorithm James Goodman; References; 9. A Berry-type Paradox Gabriele Lolli; References; 10. in Number Theory Toby Ord and Tien D. Kieu; 10.1. Recursive Enumerability, Algorithmic Randomness and ; 10.2. Diophantine Equations and Hilbert's Tenth Problem 10.3. Expressing Omega Through Diophantine Equations |
| Record Nr. | UNINA-9910822222903321 |
| Singapore ; ; Hackensack, NJ, : World Scientific, c2007 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
